Generating Minimal k-Vertex Connected Spanning Subgraphs
نویسندگان
چکیده
We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.
منابع مشابه
Generating 3-vertex connected spanning subgraphs
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial time, i.e., for every K we can generate K (or all) minimal 3-vertex connected spanning subgraphs of a given graph in O(K2log(K)m2 +K2m3) time, where n and m are the number of vertices and edges of the input graph, respec...
متن کاملGenerating k-Vertex Connected Spanning Subgraphs and k-Edge Connected Spanning Subgraphs
We show that k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k. We also show that generating k-edge connected spanning subgraphs, where k is part of the input, can be done in incremental polynomial time. These results are based on properties of minimally k-connected graphs which might be of independent interest.
متن کاملOn Generation of Cut Conjunctions, Minimal K-connected Spanning Subgraphs, Minimal Connected and Spanning Subsets and Vertices
OF THE DISSERTATION On Generation of Cut Conjunctions, Minimal k-Connected Spanning Subgraphs, Minimal Connected and Spanning Subsets and Vertices by Konrad Borys Dissertation Director: Professor Endre Boros We consider the following problems: • Cut conjunctions in graphs: given an undirected graphG = (V,E) and a collection of vertex pairs B ⊆ V × V generate all minimal edge sets X ⊆ E such tha...
متن کاملFinding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5
The problem of finding a minimum weight k-vertex connected spanning subgraph is considered. For k ≥ 2, this problem is known to be NP-hard. Combining properties of inclusion-minimal k-vertex connected graphs and of k-out-connected graphs (i.e., graphs which contain a vertex from which there exist k internally vertex-disjoint paths to every other vertex), we derive polynomial time approximation ...
متن کاملA tight bound on the collection of edges in MSTs of induced subgraphs
Let G = (V,E) be a complete n-vertex graph with distinct positive edge weights. We prove that for k ∈ {1, 2, . . . , n − 1}, the set consisting of the edges of all minimum spanning trees (MSTs) over induced subgraphs of G with n − k + 1 vertices has at most nk − ( k+1 2 ) elements. This proves a conjecture of Goemans and Vondrak [1]. We also show that the result is a generalization of Mader’s T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007